/*
import java.util.Scanner;

public class Tri {
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter n: ");
        int n = sc.nextInt();
        hanoi(n,'f','a','t');
    }

    getArea(4);

    public static int getArea(4)  //4
    {

            if (4 == 1)
            {
                return 1;
            }
            else
            {
                return getArea(4 - 1) + 4;
                public static int getArea(3)  //4
                {

                    if (3 == 1)
                    {
                        return 1;
                    }
                    else
                    {
                        return getArea(3 - 1) + 3;  6
                        public static int getArea(2)  //3
                        {

                            if (2 == 1)
                            {
                                return 1;
                            }
                            else
                            {
                                return getArea(2 - 1) + 2;  3
                                public static int getArea(1)  1
                                {

                                    if (1 == 1)
                                    {
                                        return 1;
                                    }
                                    else
                                    {
                                        return getArea(4 - 1) + 4;

                                    }
                                }


                            }
                        }

                    }
                }

            }
    }

}
public static int getArea(int 4) {
    getArea(4- 1) + 4;

    getArea(3-1) + 3;

    getArea(2- 1) + 2;

    1
}
*/
/*
* n=2，有两个圆盘的情况。
* hanoi(2,f,a,t)
*if (n == 1)
        {
            System.out.println("Move" + n + "from " + f + " to " + t);
            return;
        }                                                                                初始状态  =
        hanoi(1, f, t, a);                                                                       ===
        * {                                                                                       f      a      t
        * System.out.println("Move" + n + "from " + f + " to " + t);  1,f,a  将最小的从f 移动到 a -----------------------------------
        * }
        *                                                                                        ===     =
        *                                                                                         f      a      t
        System.out.println("Move" + n + "from " + f + " to " + t);   2，f,t  将最大的从f移动到t------------------------------------
        *
        *                                                                                                =     ===
        *                                                                                         f      a      t
        *
        hanoi(1, a, f, t);
        * System.out.println("Move" + n + "from " + f + " to " + t);  1, a , t  将最小的从a移动到t-----------------------------------------------------
        *                                                                                                       =
        *                                                                                                      ===
        *                                                                                         f      a      t
    }
* */

